Bicomplex signals with sparsity constraints

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Surface inpainting with sparsity constraints

In this paper we devise a new algorithm for completing surface with missing geometry and topology founded upon the theory and techniques of sparse signal recovery. The key intuition is that any meaningful 3D shape, represented as a discrete mesh, almost certainly possesses a low-dimensional intrinsic structure, which can be expressed as a sparse representation in some transformed domains. Inste...

متن کامل

Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints

We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the resulting optimization problem is generally NP-hard, several approximation algorithms are considered. We analyze the performance of these algorithms, focusing on the characterization of the trade-off between accuracy a...

متن کامل

Online Linear Optimization with Sparsity Constraints

We study the problem of online linear optimization with sparsity constraints in the 1 semi-bandit setting. It can be seen as a marriage between two well-known problems: 2 the online linear optimization problem and the combinatorial bandit problem. For 3 this problem, we provide two algorithms which are efficient and achieve sublinear 4 regret bounds. Moreover, we extend our results to two gener...

متن کامل

Heterogeneous multitask learning with joint sparsity constraints

Multitask learning addresses the problem of learning related tasks whose information on parameters is assumed to be shared with each other. Previous approaches usually deal with homogeneous tasks such as a set of regression tasks only or a set of classification tasks only. In this paper, we consider the problem of learning multiple related tasks, where tasks consist of predicting both continuou...

متن کامل

Inline hologram reconstruction with sparsity constraints.

Inline digital holograms are classically reconstructed using linear operators to model diffraction. It has long been recognized that such reconstruction operators do not invert the hologram formation operator. Classical linear reconstructions yield images with artifacts such as distortions near the field-of-view boundaries or twin images. When objects located at different depths are reconstruct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Methods in the Applied Sciences

سال: 2018

ISSN: 0170-4214

DOI: 10.1002/mma.5059